Direct Sum Decomposability of Polynomials and Factorization of Associated Forms
نویسنده
چکیده
For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of the Macaulay inverse system of its Milnor algebra. This leads to an if-and-only-if criterion for direct sum decomposability of such a polynomial, and to an algorithm for computing direct sum decompositions over any field, either of characteristic 0 or of sufficiently large positive characteristic, for which polynomial factorization algorithms exist. We also give simple necessary criteria for direct sum decomposability of arbitrary homogeneous polynomials over arbitrary fields and apply them to prove that many interesting classes of homogeneous polynomials are not direct sums.
منابع مشابه
Decomposition of Polytopes and Polynomials
Motivated by a connection with the factorization of multivariable polynomials, we study integral convex polytopes and their integral decompositions in the sense of the Minkowski sum. We first show that deciding decomposability of integral polygons is NP-complete then present a pseudo-polynomial time algorithm for decomposing polygons. For higher dimensional polytopes, we give a heuristic algori...
متن کاملNon-unique factorization of polynomials over residue class rings of the integers
We investigate non-unique factorization of polynomials in Zpn [x] into irreducibles. As a Noetherian ring whose zero-divisors are contained in the Jacobson radical, Zpn [x] is atomic. We reduce the question of factoring arbitrary non-zero polynomials into irreducibles to the problem of factoring monic polynomials into monic irreducibles. The multiplicative monoid of monic polynomials of Zpn [x]...
متن کاملOn Tractability of Disjoint AND-Decomposition of Boolean Formulas
Disjoint AND-decomposition of a boolean formula means its representation as a conjunction of two (or several) formulas having disjoint sets of variables. We show that deciding AND-decomposability is intractable in general for boolean formulas given in CNF or DNF and prove tractability of computing AND-decompositions of boolean formulas given in positive DNF, Full DNF, and ANF. The results follo...
متن کاملPolynomial irreducibility testing through Minkowski summand computation
In this paper, we address the problem of deciding absolute irreducibility of multivariate polynomials. Our work has been motivated by a recent work due to Gao et. al. [1, 2, 3] where they have considered the problem for bivariate polynomials by studying the integral decomposability of polygons in the sense of Minkowski sum. We have generalized their result to polynomials containing arbitrary nu...
متن کاملThe Polynomials of a Graph
In this paper, we are presented a formula for the polynomial of a graph. Our main result is the following formula: [Sum (d{_u}(k))]=[Sum (a{_kj}{S{_G}^j}(1))], where, u is an element of V(G) and 1<=j<=k.
متن کامل